Humans Outperform Machines at the Bilingual Shannon Game
نویسندگان
چکیده
منابع مشابه
Humans Outperform Machines at the Bilingual Shannon Game
We provide an upper bound for the amount of information a human translator adds to an original text, i.e., how many bits of information we need to store a translation, given the original. We do this by creating a Bilingual Shannon Game that elicits character guesses from human subjects, then developing models to estimate the entropy of those guess sequences.
متن کاملStrategies for the Shannon switching game
We present a proof that the Shannon switching game on a graph with distinguished vertices A and B has a winning strategy for player Short iff the graph has a subgraph connecting A to B with two edge disjoint spanning trees. This theorem was first proved by Lehman in [11]. The difficulty is that his proof is phrased in terms of matroids and appears very difficult. However, I was able to cull a n...
متن کاملThreat, support and dead edges in the Shannon game
The notions of captured/lost vertices and dead edges in the Shannon game (Shannon switching game on nodes) are examined using graph theory. Simple methods are presented for identifying some dead edges and some captured sets of vertices, thus simplifying the (computationally hard) problem of analyzing the game.
متن کاملGame Semantics & Abstract Machines
The inreraciioii processes at work iii Hylund arid Oizg (HO) urid Abrniiisky, .laguciee.snii uiidMulmaria (A.JM) new game seninritics are two preexisting pavadiginatic iiiipleriieriiafioiis ojlinear head reduction: re~I7ecfively Kriviiie’s RDsfrucr Machine and Girard4 Interactiori Abstract Mncli he. There is U simple oizd tiuirrral embedding ojA.lM-ganzes to MI-ganies, mappirig sirategies to sr...
متن کاملDead Cell Analysis in Hex and the Shannon Game
In 1981 Claude Berge asked about combinatorial properties that might be used to solve Hex puzzles. In response, we establish properties of dead, or negligible, cells in Hex and the Shannon game. A cell is dead if the colour of any stone placed there is irrelevant to the theoretical outcome of the game. We show that dead cell recognition is NPcomplete for the Shannon game; we also introduce two ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Entropy
سال: 2016
ISSN: 1099-4300
DOI: 10.3390/e19010015